Combinatorial changes of euclidean minimum spanning tree of moving points in the plane
نویسندگان
چکیده
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that the motion of the points in the plane, is defined by algebraic functions of maximum degree s of time. We prove an upper bound of O(nβ2s(n )) for the number of the combinatorial changes of the EMST, where βs(n)=λs(n)/n and λs(n) is the maximum length of Davenport-Schinzel sequences of order s on n symbols which is nearly linear in n. This result is an O(n) improvement over the previously trivial bound of O(n).
منابع مشابه
Maintaining a Minimum Spanning Tree for Kinetic Autonomous Robots in 2D-Euclidean Plane
This paper presents a procedure for maintaining a 2D-Euclidean Minimum Spanning Tree for a set of n autonomous kinetic robots having no central supervision. The proposed procedure is based on the Kinetic data structure framework and the well known fact that the edges of the minimum spanning tree for a given set of points in the 2D-Euclidean domain are contained in the edges of its Delaunay tria...
متن کاملCombinatorial Optimization
Here we are given a finite connected undirected graph (V,E) (so V is the set of vertices and E the set of edges) and weights on the edges, i.e., c(e) ∈ R for all e ∈ E. The task is to find a set T ⊆ E such that (V, T ) is a (spanning) tree and ∑ e∈T c(e) is minimum. (Recall that a tree is a connected graph without cycles.) The figure below shows on the left a set V of eight points in the Euclid...
متن کاملThe probabilistic minimum spanning tree problem
In this paper we consider a natural probabilistic variation of the classical minimum spanning tree problem (MST), which we call the probabilistic minimum spanning tree problem (PMST). In particular, we consider the case where not all the points are deterministically present, but are present with certain probability. We discuss the applications of the PMST and find a closed-form expression for t...
متن کاملOn the Euclidean Minimum Spanning Tree Problem∗
Given a weighted graph G(V,E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. The weight on any edge is the Euclidean distance between the two points. Finding a minimum spanning...
متن کاملLow-Cost Fault-Tolerant Spanning Graphs for Point Sets in the Euclidean Plane
The concept of the minimum spanning tree (MST) plays an important role in topological network design, because it models a cheapest connected network. In a tree, however, the failure of a vertex can disconnect the network. In order to tolerate such a failure, we generalize the MST to the concept of a cheapest biconnected network. For a set of points in the Euclidean plane, we show that it is NP-...
متن کامل